Untersuchung und Eindämmung eines SARS-CoV-2-Alpha-Ausbruchs in einer Pflegeeinrichtung im Landkreis Dithmarschen, Juni 2021

Bewohnende und Personal in Pflegeeinrichtungen gehören zu den Personengruppen, die ab dem 27.12.2020 in Deutschland priorisiert die COVID-19-Impfung erhielten. Diese zeigte eine gute Wirksamkeit hinsichtlich des Schutzes vor Infektionen mit der Alpha-Variante und eine sehr hohe Wirksamkeit vor schweren Krankheitsverläufen. In einer Pflegeeinrichtung im Landkreis Dithmarschen kam es zwischen dem 01.04. und 23.06.2021 dennoch zu einem SARS-CoV-2-Ausbruch, bei dem eine hohe Anzahl vollständig geimpfter Personen infiziert wurde und teilweise schwer erkrankte oder verstarb. Beschrieben werden zum einen die Methoden, die bei der Ausbruchsuntersuchung im Pflegeheim angewandt wurden, und zum anderen die Maßnahmen, die schlussendlich zur Ausbruchseindämmung beitrugen.Peer Reviewe

Towards Efficient Processing of General-Purpose Joins in Sensor Networks

Join processing in wireless sensor networks is difficult: As the tuples can be arbitrarily distributed within the network, matching pairs of tuples is communication intensive and costly in terms of energy. Current solutions only work well with specific placements of the nodes and/or make restrictive assumptions. In this paper, we present SENS-Join, an efficient general-purpose join method for sensor networks. To obtain efficiency, SENS-Join does not ship tuples that do not join, based on a filtering step. Our main contribution is the design of this filtering step which is highly efficient in order not to exhaust the potential savings. We demonstrate the performance of SENS-Join experimentally: The overall energy consumption can be reduced by more than 80%, as compared to the state-of-the-art approach. The per node energy consumption of the most loaded nodes can be reduced by more than an order of magnitude

A classification of issues and approaches in automatic service composition

Resulting from the constantly increasing usage of service oriented computing, the problem of automatic composition of services is rapidly gaining attention. Many solutions have been proposed, yet too little attention has been paid to thoroughly analyzing the different needs that require the ability of (automatic) service composition. This paper therefore aims at identifying the different cases in which service composition is needed and at classifying existing approaches accordingly. Three distinguishable types of service composition applications are described along with their basic problems and various approaches addressing the identified classes are presented

DIANE -- An Integrated Approach to Automated Service Discovery, Matchmaking and Composition

Automated matching of semantic service descriptions is the key to automatic service discovery and binding. But when trying to find a match for a certain request it may often happen, that the request cannot be serviced by a single offer but could be handled by combining existing offers. In this case automatic service composition is needed. Although automatic composition is an active field of research it is mainly viewed as a planning problem and treated separatedly from service discovery. In this paper we argue that an integrated approach to the problem is better than seperating these issues as is usually done. We propose an approach that integrates service composition into service discovery and matchmaking to match service requests that ask for multiple connected effects, discuss general issues involved in describing and matching such services and present an efficient algorithm implementing our ideas

08421 Working Group: Explanation

This working group addressed the issue of explaining the results of an uncertainty information system to a user. For that, we structured the problem along three major queries: why, what, and how